building algorithm造句
例句與造句
- we combine incremental methods with tree building algorithm and present a new algorithm, which is suitable for increasingly training set and is very efficient
將增量式學(xué)習(xí)的方法與建樹算法相結(jié)合，使其能夠處理不斷生長的訓(xùn)練集，提高算法的實時、有效性。 - the main study involves context extracting, partitioning, reducting, isomorphic detecting, algebraic character and building algorithms of the context kernel
主要的研究內(nèi)容涉及形式背景的提取、切分、約簡和同構(gòu)判定,以及形式背景核的代數(shù)性質(zhì)和形式背景核的構(gòu)造算法等。 - the level building algorithm is used to match a series of dtw to an observation sequence, without having to first segment the sequence into sub-sequences produced by different models
lbdtw算法不需要預(yù)先將連續(xù)輸入的字符預(yù)分割為單字字符數(shù)據(jù),而直接將連續(xù)輸入的待測字符序列與所有參考模式進行dtw匹配識別。 - and then it researches the key techniques of data mining system in detail, including data preprocess, algorithm management, building algorithm library and data mining model visualization
然后詳細研究了構(gòu)建數(shù)據(jù)挖掘系統(tǒng)的關(guān)鍵技術(shù),包括數(shù)據(jù)的預(yù)處理、挖掘算法的管理、算法庫的構(gòu)建以及數(shù)據(jù)挖掘模型的可視化。 - 3 ) to discover association rules, we present a framework based on concept lattice . first, in the light of the requirement of mining association rules, the structure of concept node is simplified, and the corresponding building algorithm is developed . then we give out the algorithms for extracting association rules from the lattice based on intent reduct, where two properties are exploited to remove the redundant rules
首先，針對關(guān)聯(lián)規(guī)則發(fā)現(xiàn)的需求，我們對概念格節(jié)點的結(jié)構(gòu)進行了相應(yīng)的簡化修改，并給出了相應(yīng)的構(gòu)造算法；然后基于內(nèi)涵縮減，我們給出了從格上提取關(guān)聯(lián)規(guī)則的算法偽碼，兩個性質(zhì)被用來去除冗余的關(guān)聯(lián)規(guī)則；文中還分析了基于概念格的關(guān)聯(lián)規(guī)則發(fā)現(xiàn)與傳統(tǒng)的發(fā)現(xiàn)算法相比所具有一系列的優(yōu)點。 - It's difficult to find building algorithm in a sentence. 用building algorithm造句挺難的
- (5 ) the definitions, characteristics and all kinds of building algorithms of the voronoi diagram and the delaunay triangle are introduced . their applications in sdm are explored . that the voronoi diagram is an effective method to partition the influence regions between spatial objects and phenomena is put forward, and that the principle of building voronoi diagram is identical to the forming central place is proved
(5)系統(tǒng)研究了voronoi圖和delaunay三角網(wǎng)的定義、性質(zhì)及各種建立算法，并對它們在空間數(shù)據(jù)挖掘中的應(yīng)用進行了探索性研究：提出voronoi圖是界定空間目標(現(xiàn)象)的空間影響范圍的一種行之有效的辦法；從理論上論證了voronoi圖的形成與城市中心地的形成是一致的，提出delaunay三角網(wǎng)是建立城鎮(zhèn)網(wǎng)絡(luò)體系的最佳模型；研究了利用voronoi圖進行公共設(shè)施選址優(yōu)化的算法及實現(xiàn)。 - thirdly, the functions of reversibility of the built bar code and changeableness of the color of bar code have been improved by combining various build algorithms with the methods of software programming . as vc + + 6.0 is used as the design platform for the generative system of bar code, and the ways of software programming have been learned and the build principles of program frame as well as the coding principles of menu, dialog box, toolbar, . document and view have been applied to finish the software finally
再次，是把各種算法與計算機軟件編程知識相結(jié)合，對常用軟件條碼方案中存在的生成條碼不可修改、條碼顏色太過單一這兩點不足之處進行了相應(yīng)的改進；本課題選用vc++6.0作為條碼生成系統(tǒng)的設(shè)計平臺，系統(tǒng)學(xué)習(xí)了該編程平臺編寫軟件的方法，并應(yīng)用程序框架的執(zhí)行原理，菜單、對話框、工具欄以及文檔視圖的編寫原理，最終實現(xiàn)了條碼生成系統(tǒng)軟件化過程。 - a modified k-means method which can reduce compute complexity greatly is proposed to cluster similar customers . churn prediction adopts decision trees algorithms . after presenting a brief overview of tree-building algorithm and tree-pruning algorithm of traditional decision trees, the paper describes how to push constraints into the tree-building phase and tree-pruning phase in detail
離網(wǎng)預(yù)測采用了決策樹分類器，本文在描述決策樹算法中所涉及到的建樹、代價計算、剪枝等問題之后，給出了在建樹中和建樹后分別加入限制條件的修剪算法。